Bi-immunity results for cheatable setsBEIGEL, R.Theoretical computer science. 1990, Vol 73, Num 3, pp 249-263, issn 0304-3975, 15 p.Article

Bounded queries to SAT and the Boolean hierarchyBEIGEL, R.Theoretical computer science. 1991, Vol 84, Num 2, pp 199-223, issn 0304-3975Article

Relativized counting classes : relations among thresholds, parity, and modsBEIGEL, R.Journal of computer and system sciences (Print). 1991, Vol 42, Num 1, pp 76-96, issn 0022-0000, 21 p.Article

Unbounded searching algorithmsBEIGEL, R.SIAM journal on computing (Print). 1990, Vol 19, Num 3, pp 522-537, issn 0097-5397, 16 p.Article

Counting classes: thresholds, parity, mods, and fewnessBEIGEL, R; GILL, J.Theoretical computer science. 1992, Vol 103, Num 1, pp 3-23, issn 0304-3975Conference Paper

A comparison of resource-bounded molecular computation modelsFU, B; BEIGEL, R.Algorithmica. 1999, Vol 24, Num 2, pp 87-95, issn 0178-4617Article

On the complexity of finding the chromatic number of a recursive graph. I: The bounded caseBEIGEL, R; GASARCH, W. I.Annals of pure and applied logic. 1989, Vol 45, Num 1, pp 1-38, issn 0168-0072, 38 p.Article

Downward separation fails catastrophically for limited nondeterminism classesBEIGEL, R; GOLDSMITH, J.SIAM journal on computing (Print). 1998, Vol 27, Num 5, pp 1420-1429, issn 0097-5397Article

On the complexity of finding the chromatic number of a recursive graph. II: The unbounded caseBEIGEL, R; GASARCH, W. I.Annals of pure and applied logic. 1989, Vol 45, Num 3, pp 227-246, issn 0168-0072Article

PP is closed under intersectionBEIGEL, R; REINGOLD, N; SPIELMAN, D et al.Journal of computer and system sciences (Print). 1995, Vol 50, Num 2, pp 191-202, issn 0022-0000Conference Paper

Terse, superterse, and verbose setsBEIGEL, R; GASARCH, W. I; GILL, J et al.Information and computation (Print). 1993, Vol 103, Num 1, pp 68-85, issn 0890-5401Article

Approximable setsBEIGEL, R; KUMMER, M; STEPHAN, F et al.Information and computation (Print). 1995, Vol 120, Num 2, pp 304-314, issn 0890-5401Article

The complexity of modular graph automorphismARVIND, V; BEIGEL, R; LOZANO, A et al.SIAM journal on computing (Print). 2001, Vol 30, Num 4, pp 1299-1320, issn 0097-5397Article

Molecular computing, bounded nondeterminism, and efficient recursionBEIGEL, R; FU, B.Algorithmica. 1999, Vol 25, Num 2-3, pp 222-238, issn 0178-4617Article

The geometry of browsingBEIGEL, R; TANIN, E.Lecture notes in computer science. 1998, pp 331-340, issn 0302-9743, isbn 3-540-64275-7Conference Paper

Quantifying the amount of verbosenessBEIGEL, R; KUMMER, M; STEPHAN, F et al.Information and computation (Print). 1995, Vol 118, Num 1, pp 73-90, issn 0890-5401Article

Almost-everywhere complexity hierarchies for nondeterministic timeALLENDER, E; BEIGEL, R; HERTRAMPF, U et al.Theoretical computer science. 1993, Vol 115, Num 2, pp 225-241, issn 0304-3975Article

Counting classes: thresholds, parity, mods, and fewnessBEIGEL, R; GILL, J; HERTRAMPF, U et al.Lecture notes in computer science. 1990, Vol 415, pp 49-57, issn 0302-9743Conference Paper

Probabilistic polynomial time is closed under parity reductionsBEIGEL, R; HEMACHANDRA, L. A; WECHSUNG, G et al.Information processing letters. 1991, Vol 37, Num 2, pp 91-94, issn 0020-0190, 4 p.Article

A note on the almost-everywhere hierarchy for nondeterministic timeALLENDER, E; BEIGEL, R; HERTRAMPF, U et al.Lecture notes in computer science. 1990, Vol 415, pp 1-11, issn 0302-9743Conference Paper

Nondeterministic bounded quercy reducibilitiesBEIGEL, R; GASARCH, W; OWINGS, J et al.Annals of pure and applied logic. 1989, Vol 41, Num 2, pp 107-118, issn 0168-0072Article

The complexity of modular Graph AutomorphismARVIND, V; BEIGEL, R; LOZANO, A et al.Lecture notes in computer science. 1998, pp 172-182, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Molecular computing, bounded nondeterminism, and efficient recursionBEIGEL, R; FU, B.Lecture notes in computer science. 1997, pp 816-826, issn 0302-9743, isbn 3-540-63165-8Conference Paper